-
1 веса ребер
Makarov: edges weights
См. также в других словарях:
Binary moment diagram — A binary moment diagram (BMD) is a generalization of the binary decision diagram (BDD) to linear functions over domains such as booleans (like BDDs), but also to integers or to real numbers.They can deal with boolean functions with complexity… … Wikipedia
Permanent is sharp-P-complete — The correct title of this article is Permanent is #P complete. The substitution or omission of the # sign is because of technical restrictions. In a 1979 paper Leslie Valiant proved[1] that the problem of computing the permanent of a matrix is #P … Wikipedia
Bellman-Ford algorithm — The Bellman–Ford algorithm, a label correcting algorithm [cite web |url=http://www.mit.edu/people/dimitrib/SLF.pdf |title=A Simple and Fast Label Correcting Algorithm for Shortest Paths |accessdate=2008 10 01 |author=Dimitri P. Bertsekas… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
steel — steellike, adj. /steel/, n. 1. any of various modified forms of iron, artificially produced, having a carbon content less than that of pig iron and more than that of wrought iron, and having qualities of hardness, elasticity, and strength varying … Universalium
balance — balanceable, adj. /bal euhns/, n., v., balanced, balancing. n. 1. a state of equilibrium or equipoise; equal distribution of weight, amount, etc. 2. something used to produce equilibrium; counterpoise. 3. mental steadiness or emotional stability; … Universalium
balancé — /bal euhn say /; Fr. /bann lahonn say /, n., pl. balancés / sayz /; Fr. / say /. Ballet. a swaying step performed in place in which the weight is lightly shifted from one foot to the other, the dancer sinking down on the heel of the foot to which … Universalium
Quantitative comparative linguistics — is a branch of comparative linguistics that applies mathematical models to the problem of classifying language relatedness. This includes the use of computational phylogenetics and cladistics to define an optimal tree (or network) to represent a… … Wikipedia